Abstraction Heuristics Extended with Counting Abstractions
نویسنده
چکیده
ion Heuristics Extended with Counting Abstractions Blai Bonet Departamento de Computación Universidad Simón Bolı́var Caracas, Venezuela
منابع مشابه
When Abstractions Met Landmarks
Abstractions and landmarks are two powerful mechanisms for devising admissible heuristics forions and landmarks are two powerful mechanisms for devising admissible heuristics for classical planning. Here we aim at putting them together by integrating landmark information into abstractions, and propose a concrete realization ofions, and propose a concrete realization of this direction suitable f...
متن کاملCounterexample-Guided Cartesian Abstraction Refinement
Counterexample-guided abstraction refinement (CEGAR) is a method for incrementally computing abstractions of transition systems. We propose a CEGAR algorithm for computing abstraction heuristics for optimal classical planning. Starting from a coarse abstraction of the planning task, we iteratively compute an optimal abstract solution, check if and why it fails for the concrete planning task and...
متن کاملRefining abstraction heuristics with mutexes
Planning as heuristic search is a powerful approach to solve domain-independent planning problems. An important class of heuristics is based on abstractions of the original planning task. However it comes with loss in precision. The contribution of this thesis is the concept of constrained abstraction heuristics in general, and the application of this concept to pattern database and merge and s...
متن کاملThe VerCors Tool Set: Verification of Parallel and Concurrent Software
models are process algebra terms Wytse Oortwijn, UTwente Verifying Concurrent Software 25 / 30 Introduction Deterministic Parallelism GPU Kernels Model Abstractions Conclusion Our approach: deducative + algorithmic verification requires Process(P); ensures Process(ε); void main(args) { S1 ‖ S2; } Process algebras abstraction Algorithmic analysis input Temporal properties LTL, CTL, etc. input De...
متن کاملState-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning (Extended Abstract)
Abstraction heuristics are a popular method to guide optimal search algorithms in classical planning. Cost partitionings allow to sum heuristic estimates admissibly by partitioning action costs among the abstractions. We introduce state-dependent cost partitionings which take context information of actions into account, and show that an optimal state-dependent cost partitioning dominates its st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011